Goto

Collaborating Authors

 function form


Towards Adaptive IMFs -- Generalization of utility functions in Multi-Agent Frameworks

Dey, Kaushik, Perepu, Satheesh K., Das, Abir, Dasgupta, Pallab

arXiv.org Artificial Intelligence

Intent Management Function (IMF) is an integral part of future-generation networks. In recent years, there has been some work on AI-based IMFs that can handle conflicting intents and prioritize the global objective based on apriori definition of the utility function and accorded priorities for competing intents. Some of the earlier works use Multi-Agent Reinforcement Learning (MARL) techniques with AdHoc Teaming (AHT) approaches for efficient conflict handling in IMF. However, the success of such frameworks in real-life scenarios requires them to be flexible to business situations. The intent priorities can change and the utility function, which measures the extent of intent fulfilment, may also vary in definition. This paper proposes a novel mechanism whereby the IMF can generalize to different forms of utility functions and change of intent priorities at run-time without additional training. Such generalization ability, without additional training requirements, would help to deploy IMF in live networks where customer intents and priorities change frequently. Results on the network emulator demonstrate the efficacy of the approach, scalability for new intents, outperforming existing techniques that require additional training to achieve the same degree of flexibility thereby saving cost, and increasing efficiency and adaptability.


A Closer Look at Parameter-Efficient Tuning in Diffusion Models

Xiang, Chendong, Bao, Fan, Li, Chongxuan, Su, Hang, Zhu, Jun

arXiv.org Artificial Intelligence

Large-scale diffusion models like Stable Diffusion are powerful and find various real-world applications while customizing such models by fine-tuning is both memory and time inefficient. Motivated by the recent progress in natural language processing, we investigate parameter-efficient tuning in large diffusion models by inserting small learnable modules (termed adapters). In particular, we decompose the design space of adapters into orthogonal factors -- the input position, the output position as well as the function form, and perform Analysis of Variance (ANOVA), a classical statistical approach for analyzing the correlation between discrete (design options) and continuous variables (evaluation metrics). Our analysis suggests that the input position of adapters is the critical factor influencing the performance of downstream tasks. Then, we carefully study the choice of the input position, and we find that putting the input position after the cross-attention block can lead to the best performance, validated by additional visualization analyses. Finally, we provide a recipe for parameter-efficient tuning in diffusion models, which is comparable if not superior to the fully fine-tuned baseline (e.g., DreamBooth) with only 0.75 \% extra parameters, across various customized tasks.


Connectionism - Switching and Fast Transforms

#artificialintelligence

If you are a connectionist (and who isn't?) you should know what the terms switch, connect and disconnect mean. A switch when on gives: zero volts in zero volts out, 1 volt in 1 volt out, 2 volts in 2 volts out. If you graph that out in a uniform way you get a 45 degree line. The function form is f(x) x and the meaning is connect. A switch when off gives only zero volts out.


Robust Regression for Automatic Fusion Plasma Analysis based on Generative Modeling

Fujii, Keisuke, Suzuki, Chihiro, Hasuo, Masahiro

arXiv.org Machine Learning

The first step to realize automatic experimental data analysis for fusion plasma experiments is fitting noisy data of temperature and density spatial profiles, which are obtained routinely. However, it has been difficult to construct algorithms that fit all the data without over- and under-fitting. In this paper, we show that this difficulty originates from the lack of knowledge of the probability distribution that the measurement data follow. We demonstrate the use of a machine learning technique to estimate the data distribution and to construct an optimal generative model. We show that the fitting algorithm based on the generative modeling outperforms classical heuristic methods in terms of the stability as well as the accuracy.